Joining of Decorated Trees
نویسنده
چکیده
This is the continuation of the sequence of articles on trees (see [2], [4], [5]). The main goal is to introduce joining operations on decorated trees corresponding with operations introduced in [5]. We will also introduce the operation of substitution. In the last section we dealt with trees decorated by Cartesian product, i.e. we showed some lemmas on joining operations applied to such trees.
منابع مشابه
Sets and Functions of Trees and Joining Operations of Trees
In the article we deal with sets of trees and functions yielding trees. So, we introduce the sets of all trees, all finite trees and of all trees decorated by elements from some set. Next, the functions and the finite sequences yielding (finite, decorated) trees are introduced. There are shown some convenient but technical lemmas and clusters concerning with those concepts. In the fourth sectio...
متن کاملDecorated hypertrees
C. Jensen, J. McCammond and J. Meier have used weighted hypertrees to compute the Euler characteristic of a subgroup of the automorphism group of a free product. Weighted hypertrees also appear in the study of the homology of the hypertree poset. We link them to decorated hypertrees after a general study on decorated hypertrees, which we enumerate using box trees.
متن کاملKönig ’ s Lemma
A contiuation of [5]. The notions of finite-order trees, succesors of an element of a tree, and chains, levels and branches of a tree are introduced. Those notions are used to formalize König’s Lemma which claims that there is a infinite branch of a finite-order tree if the tree has arbitrary long finite chains. Besides, the concept of decorated trees is introduced and some concepts dealing wit...
متن کاملQuickJoin - fast neighbour-joining tree reconstruction
We have built a tool for fast construction of very large phylogenetic trees. The tool uses heuristics for speeding up the neighbour-joining algorithm-while still constructing the same tree as the original neighbour-joining algorithm-making it possible to construct trees for 8000 species in <10 min on a single desktop PC. In comparison, the same task takes more than 30 min using the QuickTree ne...
متن کاملIntegrable Renormalization II: the general case
We extend the results we obtained in an earlier work [1]. The cocommutative case of ladders is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the Birkhoff decomposition of renormalization theory is derived by using the RotaBaxter double construction, respectively Atkinson’s theorem. We also outline the extension...
متن کامل